Optimal routeing in two-queue polling systems
نویسندگان
چکیده
منابع مشابه
Optimal routing in two-queue polling systems
We consider a polling system with two queues, exhaustive service, no switch-over times and exponential service times with rate μ in each queue. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where no server is). Customers arrive according to a...
متن کاملOn the optimal control of a two-queue polling model
This paper deals with two M/M/1 queues served by a single server with threshold switching. Our main goal is to solve the Poisson equation and, as a result, give expressions for the long-run expected average cost of holding units and switching actions of the server, and the bias vector.
متن کاملOn two-queue Markovian polling systems with exhaustive service
We consider a class of two-queue polling systems with exhaustive service, where the order in which the server visits the queues is governed by a discrete-time Markov chain. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we obtain explicit expressions for the Laplace-Stieltjes trans...
متن کاملQueue lengths and workloads in polling systems
We consider a polling system: a queueing system of N ≥ 1 queues with Poisson arrivals Q1, . . . , QN visited in a cyclic order (with or without switchover times) by a single server. For this system we derive the probability generating function Q(·) of the joint queue length distribution at an arbitrary epoch in a stationary cycle, under no assumptions on service disciplines. We also derive the ...
متن کاملTwo-Queue Polling Systems with Switching Policy Based on the Queue which is Not Being Served
We study a system of two non-identical and separate M/M/1/• queues with capacities (buffers) C1 < ∞ and C2 = ∞, respectively, served by a single server that alternates between the queues. The server’s switching policy is threshold-based, and, in contrast to other threshold models, is determined by the state of the queue that is not being served. That is, when neither queue is empty while the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2018
ISSN: 0021-9002,1475-6072
DOI: 10.1017/jpr.2018.59